Comparing Mixed & Integer Programming vs. Constraint Programming by solving Job-Shop Scheduling Problems
نویسندگان
چکیده
منابع مشابه
Solving Resource Allocation/Scheduling Problems with Constraint Integer Programming
Constraint Integer Programming (CIP) is a generalization of mixed-integer programming (MIP) in the direction of constraint programming (CP) allowing the inference techniques that have traditionally been the core of CP to be integrated with the problem solving techniques that form the core of complete MIP solvers. In this paper, we investigate the application of CIP to scheduling problems that r...
متن کاملIntegrating Mixed Integer Programming and Local Search : A Case Study on Job-Shop Scheduling Problems
Recent work on solving job-shop scheduling problems with earliness and tardiness costs has led to several hybrid algorithms that are more effective than any one method alone. In particular, these hybrid methods have been found to be more effective than pure mixed integer programming (MIP) approaches. This paper takes a fresh look at MIP formulations in light of several new MIP strategies for pr...
متن کاملpreventive maintenance scheduling with integer programming and constraint programming
preventive maintenance scheduling is to perform a series of tasks that prevents or minimizes production breakdowns and improves the reliability. mathematical models have been developed to solve the preventive maintenance scheduling problem. there are several limitations in the prior work in this area of research. craft combinations are assumed to be given. the craft combination problem concerns...
متن کاملSolving the job-shop scheduling problem optimally by dynamic programming
Scheduling problems received substantial attention during the last decennia. The job-shop problem is a very important scheduling problem, which is NP-hard in the strong sense and with well-known benchmark instances of relatively small size which attest the practical difficulty in solving it. The literature on job-shop scheduling problem includes several approximation and optimal algorithms. So ...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Independent Journal of Management & Production
سال: 2015
ISSN: 2236-269X
DOI: 10.14807/ijmp.v6i1.262